Navigation Advice from pq-Histograms

نویسندگان

  • G. Gómez
  • Luis Enrique Sucar
  • Duncan Fyfe Gillies
چکیده

We propose a novel visual navigation clue based on summarising the local 3D information into a single structure, called pqhistogram. This structure is obtained by discretising the local orientation or [p, q] of an image, and building a two dimensional histogram. This histogram gives a global view of the 3D shape of the world, therefore it could be used for navigation. The potential application of the pq-histogram is illustrated in two domains. Firstly, semi-automatic navigation of an endoscope inside the human colon. Secondly, mobile robot navigating in certain environments, such as corridors and mines. In both cases, the method was tested with real images with very good results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The pq-Histogram as a Navigation Clue

We propose a novel visual clue for navigation, in which the local 3D information or (p, q) is summarised in a single structure, called pq-histogram. The pq-histogram is obtained by discretising in logarithmic scale the local depth (p, q). Since this histogram gives a global view of the scene, it could be used as a fast clue for navigation. An arrangement of four pq-histograms, one for each imag...

متن کامل

Texture Classification with the PQ Kernel

Computer vision researchers have developed various learning methods based on the bag of words model for image related tasks, including image categorization, image retrieval and texture classification. In this model, images are represented as histograms of visual words (or textons) from a vocabulary that is obtained by clustering local image descriptors. Next, a classifier is trained on the data...

متن کامل

Factoring N = pq

We discuss the problem of factoring N = pq and survey some approaches. We then present a specialized factoring algorithm that runs in time Õ(q0.31), which is comparable to the runtime Õ(p) of the factoring algorithm for integers of the form N = pq presented in [1]. We then survey the factoring algorithm of [1] and discuss the number of advice bits needed for it to run in polynomial time. Furthe...

متن کامل

Automatic Place Determination using Colour Histograms and Self-Organising Maps

In this paper we propose a model-free appearance-based method to automatically determine places as landmarks for topological navigation. Most of the current approaches for automatically selecting landmarks are based on template models or complex feature detectors. We use modified colour histograms, more precisely an entropy-constrained 3D colour clustering as appearance-based image features whi...

متن کامل

Detection of perturbed quantization (PQ) steganography based on empirical matrix

Perturbed Quantization (PQ) steganography scheme is almost undetectable with the current steganalysis methods. We present a new steganalysis method for detection of this data hiding algorithm. We show that the PQ method distorts the dependencies of DCT coefficient values; especially changes much lower than significant bit planes. For steganalysis of PQ, we propose features extraction from the e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002